Outer Median and Probabilistic Cellular Automata on Network Topologies

نویسنده

  • Abigail Nussey
چکیده

Oneand two-dimensional cellular automata have traditionally modeled systems with an underlying regular lattice well. However, for other systems, such as those with nonlocal phenomena, running cellular automata over different topologies could result in a simpler, more natural model. The creation of so-called “outer median” rules, and the use of modified probabilistic rules, make it possible to run cellular automata over network topologies. In this way, the rules themselves remain simple while more complicated nonlocal information is encoded in the topology. In this manner we can model systems with nonlocal elements, and briefly consider two examples of such systems: country border relationships and forest fire spread.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some (Fuzzy) Topologies on General\ Fuzzy Automata

In this paper, by presenting some notions and theorems, we obtaindifferent types of fuzzy topologies. In fact, we obtain someLowen-type  and Chang-type fuzzy topologies on general fuzzyautomata. To this end, first we define a Kuratowski fuzzy interioroperator which induces a  Lowen-type  fuzzy topology on the  set ofstates of a max- min general   fuzzy automaton. Also by  provingsome theorems, ...

متن کامل

A Link Prediction Method Based on Learning Automata in Social Networks

Nowadays, online social networks are considered as one of the most important emerging phenomena of human societies. In these networks, prediction of link by relying on the knowledge existing of the interaction between network actors provides an estimation of the probability of creation of a new relationship in future. A wide range of applications can be found for link prediction such as electro...

متن کامل

A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring

All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...

متن کامل

Robustness of Evolved Small-World Automata Networks

We study an extension of cellular automata to arbitrary interconnection topologies for the majority problem. By using an evolutionary algorithm, we show that small-world network topologies consistently evolve from regular and random structures without being designed beforehand. These topologies have better performance than regular lattice structures and are easier to evolve. Moreover they show ...

متن کامل

Evolving Small-World Automata for the Majority Problem

We study an extension of cellular automata to arbitrary interconnection topologies for the majority problem. By using an evolutionary algorithm, we show that small-world network topologies consistently evolve from regular and random structures without being designed beforehand. These topologies have better performance than regular lattice structures and are easier to evolve. Moreover they show ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Complex Systems

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2010